<!DOCTYPE html>
<html lang=zh-CN>
<head>
<meta charset=utf-8>
<title>计算机网络 路由选择算法实验 OSPF算法 的修改代码 | Cweili Beta</title>
<meta name=viewport content="width=device-width,initial-scale=1,maximum-scale=1,user-scalable=no">
<meta name=description content="由于老师给的代码没有输出路由表最短路径, 而且输入重复数据过多, 故做了一些小修改, 尽量保持了代码原貌, 修改处我已经着重标出, 供大家参考~">
<meta property=og:type content=article>
<meta property=og:title content="计算机网络 路由选择算法实验 OSPF算法 的修改代码">
<meta property=og:url content="http://cweili.gitcafe.com/computer-network-experiment-routing-ospf-algorithm/">
<meta property=og:site_name content="Cweili Beta">
<meta property=og:description content="由于老师给的代码没有输出路由表最短路径, 而且输入重复数据过多, 故做了一些小修改, 尽量保持了代码原貌, 修改处我已经着重标出, 供大家参考~">
<meta name=twitter:card content=summary>
<meta name=twitter:title content="计算机网络 路由选择算法实验 OSPF算法 的修改代码">
<meta name=twitter:description content="由于老师给的代码没有输出路由表最短路径, 而且输入重复数据过多, 故做了一些小修改, 尽量保持了代码原貌, 修改处我已经着重标出, 供大家参考~">
<link rel=alternative href=/atom.xml title="Cweili Beta" type=application/atom+xml>
<link rel=icon href=favicon.png>
<link rel=stylesheet href=//libs.baidu.com/bootstrap/3.2.0/css/bootstrap.min.css type=text/css>
<link rel=stylesheet href=../css/style.css type=text/css>
<!--[if lt IE 9]><script src="//cdn.staticfile.org/html5shiv/3.7/html5shiv.min.js" type="text/javascript"></script><![endif]-->
</head>
<body>
<div id=container>
<nav id=mobile-nav class=visible-xs>
<a href="/" class=mobile-nav-link>首页</a>
<ul class=category-list><li class=category-list-item><a class=category-list-link href=../category/学习笔记>学习笔记</a><span class=category-list-count>40</span></li><li class=category-list-item><a class=category-list-link href=../category/小生活>小生活</a><span class=category-list-count>27</span></li><li class=category-list-item><a class=category-list-link href=../category/杂物>杂物</a><span class=category-list-count>9</span></li></ul>
<a href="/tag/%E7%9B%B8%E5%86%8C/" class=mobile-nav-link>相册</a>
<a href="/about/" class=mobile-nav-link>关于</a>
<div class=clearfix></div>
</nav>
<div id=wrap>
<!--[if lt IE 9]><p class="browsehappy alert alert-danger">您正在使用一个<strong>过时</strong>的浏览器。请<a href="http://browsehappy.com/" target="_blank">更新您的浏览器</a>来达到更好的体验。</p><![endif]-->
<header id=header>
<div id=banner></div>
<div id=header-outer class=outer>
<div id=header-inner class=inner>
<nav class=main-nav>
<div id=main-nav-toggle class="nav-icon visible-xs"><i class="fa fa-bars"></i></div>
<a class="main-nav-link hidden-xs" href="/">首页</a>
</nav>
<nav id=category-nav class=hidden-xs>
<ul class=category-list><li class=category-list-item><a class=category-list-link href=../category/学习笔记>学习笔记</a><span class=category-list-count>40</span></li><li class=category-list-item><a class=category-list-link href=../category/小生活>小生活</a><span class=category-list-count>27</span></li><li class=category-list-item><a class=category-list-link href=../category/杂物>杂物</a><span class=category-list-count>9</span></li></ul>
</nav>
<nav class="main-nav hidden-xs">
<a class=main-nav-link href="/tag/%E7%9B%B8%E5%86%8C/">相册</a>
<a class=main-nav-link href="/about/">关于</a>
</nav>
<nav id=sub-nav>
<a id=nav-rss-link class="nav-icon pull-right hidden-xs" href=/atom.xml title="RSS 订阅"><i class="fa fa-rss"></i></a>
<div id=nav-search-btn class="nav-icon pull-right" title=搜索><i class="fa fa-search"></i></div>
</nav>
<div id=search-form-wrap>
<form action=http://www.baidu.com/baidu accept-charset=utf-8 class=search-form target=_blank>
<input type=search name=word class=search-form-input placeholder=搜索>
<input id=search-form-submit type=submit value=&nbsp; class=search-form-submit>
<input name=tn type=hidden value=bds>
<input name=cl type=hidden value=3>
<input name=ct type=hidden value=2097152>
<input type=hidden name=si value=cweili.gitcafe.com>
<label class=search-form-submit for=search-form-submit><i class="fa fa-search"></i></label>
</form>
</div>
</div>
<div id=header-title class=inner>
<h1 id=logo-wrap>
<a href="/" id=logo>Cweili Beta</a>
</h1>
<h2 id=subtitle-wrap>
<a href="/" id=subtitle>I&#39;m working on it</a>
</h2>
</div>
</div>
</header>
<div class=outer>
<section id=main class=col-sm-9><article id=post-computer-network-experiment-routing-ospf-algorithm class="article article-type-post" itemscope itemprop=blogPost>
<div class=article-meta>
<a href="/computer-network-experiment-routing-ospf-algorithm/" class=article-date>
<time datetime=2011-10-30T16:55:24.000Z itemprop=datePublished>2011-10-31</time>
</a>
<div class=article-category>
<a class=article-category-link href=../category/学习笔记>学习笔记</a>
</div>
</div>
<div class="article-inner jiathis_streak">
<header class=article-header>
<h2 class=article-title itemprop=name>
计算机网络 路由选择算法实验 OSPF算法 的修改代码
</h2>
</header>
<div class=article-entry itemprop=articleBody>
<p>由于老师给的代码没有输出路由表最短路径, 而且输入重复数据过多, 故做了一些小修改, 尽量保持了代码原貌, 修改处我已经着重标出, 供大家参考~<br><a id=more></a></p>
<figure class="highlight cpp"><table><tr><td class=gutter><pre><div class=line>1</div><div class=line>2</div><div class=line>3</div><div class=line>4</div><div class=line>5</div><div class=line>6</div><div class=line>7</div><div class=line>8</div><div class=line>9</div><div class=line>10</div><div class=line>11</div><div class=line>12</div><div class=line>13</div><div class=line>14</div><div class=line>15</div><div class=line>16</div><div class=line>17</div><div class=line>18</div><div class=line>19</div><div class=line>20</div><div class=line>21</div><div class=line>22</div><div class=line>23</div><div class=line>24</div><div class=line>25</div><div class=line>26</div><div class=line>27</div><div class=line>28</div><div class=line>29</div><div class=line>30</div><div class=line>31</div><div class=line>32</div><div class=line>33</div><div class=line>34</div><div class=line>35</div><div class=line>36</div><div class=line>37</div><div class=line>38</div><div class=line>39</div><div class=line>40</div><div class=line>41</div><div class=line>42</div><div class=line>43</div><div class=line>44</div><div class=line>45</div><div class=line>46</div><div class=line>47</div><div class=line>48</div><div class=line>49</div><div class=line>50</div><div class=line>51</div><div class=line>52</div><div class=line>53</div><div class=line>54</div><div class=line>55</div><div class=line>56</div><div class=line>57</div><div class=line>58</div><div class=line>59</div><div class=line>60</div><div class=line>61</div><div class=line>62</div><div class=line>63</div><div class=line>64</div><div class=line>65</div><div class=line>66</div><div class=line>67</div><div class=line>68</div><div class=line>69</div><div class=line>70</div><div class=line>71</div><div class=line>72</div><div class=line>73</div><div class=line>74</div><div class=line>75</div><div class=line>76</div><div class=line>77</div><div class=line>78</div><div class=line>79</div><div class=line>80</div><div class=line>81</div><div class=line>82</div></pre></td><td class=code><pre><div class=line><span class=preprocessor>#<span class=keyword>include</span> &lt;iostream&gt;</span></div><div class=line><span class=preprocessor>#<span class=keyword>include</span> &lt;cstdlib&gt;</span></div><div class=line><span class=preprocessor>#<span class=keyword>define</span> MAXPOINT 21<span class=comment>// 定义最大的顶点数目 </span></span></div><div class=line><span class=preprocessor>#<span class=keyword>define</span> limit 32767   <span class=comment>// 设置没有路径的权代替无穷大</span></span></div><div class=line></div><div class=line><span class=keyword>using</span> <span class=keyword>namespace</span> <span class=built_in>std</span>;</div><div class=line></div><div class=line><span class=keyword>struct</span> record{<span class=comment>// 没个顶点的数据结构设置为一个数组队列</span></div><div class=line>	<span class=keyword>int</span> number;		<span class=comment>// 顶点号</span></div><div class=line>	<span class=keyword>int</span> flag;		<span class=comment>// 标志是否从队列中被选过如果为 1 表示选过为 0 表示未选</span></div><div class=line>	<span class=keyword>int</span> allpath;	<span class=comment>// 从源点到这个点的当前最短距离（权最小）</span></div><div class=line>} path[MAXPOINT];   </div><div class=line></div><div class=line><span class=keyword>int</span> cost[MAXPOINT][MAXPOINT];<span class=comment>// 用来表示图的邻接矩阵</span></div><div class=line></div><div class=line><span class=keyword>int</span> main() {</div><div class=line>	<span class=comment>//********** 顶点数目改为每次运行时输入 **********</span></div><div class=line>	<span class=keyword>int</span> pointnum;</div><div class=line>	<span class=built_in>cout</span> &lt;&lt; <span class=string>"请输入顶点数目:"</span>;</div><div class=line>	<span class=built_in>cin</span> &gt;&gt; pointnum;</div><div class=line></div><div class=line>	<span class=comment>//temp 表示在数组队列中的当前下标 front 表示队列首 rear 表示队列尾 </span></div><div class=line>	<span class=comment>//N 表示待输入的源点号码 minnumber 表示选中的点的号码</span></div><div class=line>	<span class=keyword>int</span> rear = pointnum, min = <span class=number>32768</span>, i, j, temp, front = <span class=number>1</span>, N, minnumber;<span class=comment>// 设置一个初始值</span></div><div class=line>	<span class=keyword>for</span>(i = <span class=number>1</span>; i &lt;= pointnum; ++i) {</div><div class=line>		<span class=keyword>for</span>(j = <span class=number>1</span>; j &lt;= pointnum; ++j) {</div><div class=line>			<span class=comment>//********** 增加判断减少输入次数 **********</span></div><div class=line>			<span class=keyword>if</span>(i &gt; j)</div><div class=line>				cost[i][j] = cost[j][i];</div><div class=line>			<span class=keyword>else</span> <span class=keyword>if</span>(i != j) {</div><div class=line>				<span class=built_in>cout</span> &lt;&lt; <span class=string>"请输入从第"</span> &lt;&lt; i &lt;&lt; <span class=string>"点到第"</span> &lt;&lt; j &lt;&lt; <span class=string>"点的路径长度(权) 如果没有路径的话请输入'32767'\n"</span>;</div><div class=line>				<span class=built_in>cin</span> &gt;&gt; cost[i][j];<span class=comment>// 初始化所有点之间的（权）路径值</span></div><div class=line>			} <span class=keyword>else</span> cost[i][j] = <span class=number>0</span>;</div><div class=line>		}</div><div class=line>	}</div><div class=line></div><div class=line>	<span class=comment>//cout &lt;&lt; "请输入源点号" &lt;&lt; endl; // 输入一个起点</span></div><div class=line>	<span class=comment>//cin &gt;&gt; N;</span></div><div class=line></div><div class=line>	<span class=keyword>for</span>(N = pointnum; N &gt;= <span class=number>1</span>; --N) {<span class=comment>// 把每一个点轮流地都设置为起点，可以求出任意一对顶点之间的最短路径</span></div><div class=line></div><div class=line>		<span class=keyword>for</span>(i = front; i &lt;= rear; ++i) {<span class=comment>// 初始化每个点的信息</span></div><div class=line>			<span class=keyword>if</span>(i == N)</div><div class=line>				path[i].allpath = <span class=number>0</span>;</div><div class=line>			<span class=keyword>else</span></div><div class=line>				path[i].allpath = limit;</div><div class=line>			path[i].flag = <span class=number>0</span>;</div><div class=line>			path[i].number = i;</div><div class=line>		}</div><div class=line></div><div class=line>		<span class=keyword>int</span> p[MAXPOINT][MAXPOINT] = {<span class=number>0</span> };<span class=comment>//********** 用于记录最短路径 **********</span></div><div class=line></div><div class=line>		<span class=keyword>while</span>(rear &gt;= <span class=number>1</span>) {<span class=comment>// 控制循环次数</span></div><div class=line>			<span class=keyword>for</span>(temp = front; temp &lt;= pointnum; ++temp) {</div><div class=line>				<span class=keyword>if</span>(path[temp].allpath &lt; min && !path[temp].flag) {<span class=comment>// 选出一个具有最值的点</span></div><div class=line>					minnumber = path[temp].number; </div><div class=line>					min = path[temp].allpath;</div><div class=line>				}</div><div class=line>			}</div><div class=line>			min = <span class=number>32768</span>;</div><div class=line>			path[minnumber].flag = <span class=number>1</span>;<span class=comment>// 把选中的点的标志变量置 1 表示已经被选过避免选中</span></div><div class=line></div><div class=line>			<span class=keyword>for</span>(i = <span class=number>1</span>; i &lt;= pointnum; ++i) {<span class=comment>// 进行类似广度优先搜索，更新最短路径</span></div><div class=line>				<span class=keyword>if</span>((i != minnumber) && (path[minnumber].allpath + cost[minnumber][i] &lt; path[i].allpath)) {</div><div class=line>					path[i].allpath = path[minnumber].allpath + cost[minnumber][i];</div><div class=line>					p[i][++p[i][<span class=number>0</span>]] = minnumber;<span class=comment>//********** 记录最短路径 **********</span></div><div class=line>				}</div><div class=line>			}</div><div class=line>			--rear;<span class=comment>// 次数减 1</span></div><div class=line>		}</div><div class=line>		rear = pointnum; <span class=comment>// 恢复数组以便于下一点的循环</span></div><div class=line>		<span class=keyword>for</span>(j = <span class=number>1</span>; j &lt;= pointnum; ++j) {</div><div class=line>			<span class=built_in>cout</span> &lt;&lt; <span class=string>"第"</span> &lt;&lt; N &lt;&lt; <span class=string>"点到第"</span> &lt;&lt; j &lt;&lt; <span class=string>"点的最短路径长度（权）为"</span>;</div><div class=line>			<span class=built_in>cout</span> &lt;&lt; path[j].allpath &lt;&lt; <span class=string>", 路径: \n"</span>;</div><div class=line>			<span class=keyword>for</span>(<span class=keyword>int</span> k = <span class=number>1</span>; k &lt;= p[j][<span class=number>0</span>]; <span class=built_in>cout</span> &lt;&lt; p[j][k++] &lt;&lt; <span class=string>"-&gt;"</span>);<span class=comment>//********** 输出最短路径 **********</span></div><div class=line>			<span class=built_in>cout</span> &lt;&lt; j &lt;&lt; endl;</div><div class=line>		}</div><div class=line>	}</div><div class=line>	getchar();</div><div class=line>	getchar();</div><div class=line>	<span class=keyword>return</span> <span class=number>0</span>;</div><div class=line>}</div></pre></td></tr></table></figure>
<div class=ujian-hook></div>
</div>
<footer class=article-footer>
<div class=bdsharebuttonbox>
<a href=# class=bds_tsina data-cmd=tsina title=分享到新浪微博></a>
<a href=# class=bds_qzone data-cmd=qzone title=分享到QQ空间></a>
<a href=# class=bds_tqq data-cmd=tqq title=分享到腾讯微博></a>
<a href=# class=bds_weixin data-cmd=weixin title=分享到微信></a>
<a href=# class=bds_tieba data-cmd=tieba title=分享到百度贴吧></a>
<a href=# class=bds_renren data-cmd=renren title=分享到人人网></a>
<a href=# class=bds_tqf data-cmd=tqf title=分享到腾讯朋友></a>
<a href=# class=bds_douban data-cmd=douban title=分享到豆瓣网></a>
<a href=# class=bds_tsohu data-cmd=tsohu title=分享到搜狐微博></a>
<a href=# class=bds_t163 data-cmd=t163 title=分享到网易微博></a>
<a href=# class=bds_taobao data-cmd=taobao title=分享到我的淘宝></a>
<a href=# class=bds_fx data-cmd=fx title=分享到飞信></a>
<a href=# class=bds_hi data-cmd=hi title=分享到百度空间></a>
<a href=# class=bds_more data-cmd=more></a>
</div>
<ul class=article-tag-list><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/c++>C++</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/实验>实验</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/程序设计>程序设计</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/算法>算法</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/编程>编程</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/计算机>计算机</a></li><li class=article-tag-list-item><a class=article-tag-list-link href=../tag/计算机网络>计算机网络</a></li></ul>
</footer>
</div>
<nav id=article-nav>
<a href="/database-experiment-5-7/" id=article-nav-newer class=article-nav-link-wrap>
<strong class=article-nav-caption>Newer</strong>
<div class=article-nav-title>
数据库实验五 实验七 SQL命令
</div>
</a>
<a href="/get-mac-address/" id=article-nav-older class=article-nav-link-wrap>
<strong class=article-nav-caption>Older</strong>
<div class=article-nav-title>查看网卡MAC物理地址</div>
</a>
</nav>
</article>
<section id=comments>
<div class=ds-thread data-thread-key="computer-network-experiment-routing-ospf-algorithm/" data-title="计算机网络 路由选择算法实验 OSPF算法 的修改代码" data-url="http://cweili.gitcafe.com/computer-network-experiment-routing-ospf-algorithm/"></div>
</section>
</section>
<aside id=sidebar class=col-sm-3>
<div class="widget-wrap hidden-xs">
<h3 class=widget-title>分类</h3>
<div class=widget>
<ul class=category-list><li class=category-list-item><a class=category-list-link href=../category/学习笔记>学习笔记</a><span class=category-list-count>40</span></li><li class=category-list-item><a class=category-list-link href=../category/小生活>小生活</a><span class=category-list-count>27</span></li><li class=category-list-item><a class=category-list-link href=../category/杂物>杂物</a><span class=category-list-count>9</span></li></ul>
</div>
</div>
<div class=widget-wrap>
<h3 class=widget-title>最新评论</h3>
<div class=widget>
<div class=ds-recent-comments data-num-items=10 data-show-avatars=1 data-show-time=1 data-show-title=0 data-show-admin=1 data-excerpt-length=20>
<div class=text-center><i class="fa fa-refresh fa-spin"></i></div>
</div>
</div>
</div>
<div class=widget-wrap>
<h3 class=widget-title>最新文章</h3>
<div class=widget>
<ul>
<li>
<a href="/xixishidi/">河塘飞鸟西溪湿地</a>
</li>
<li>
<a href="/xizihu/">水光潋滟西子湖畔</a>
</li>
<li>
<a href="/xitang/">柳絮纷飞烟雨西塘</a>
</li>
<li>
<a href="/wuzhen/">灯火阑珊水映乌镇</a>
</li>
<li>
<a href="/stu3-zoo/">Stu3 Zoo</a>
</li>
<li>
<a href="/jshint-options/">JSHint配置参数详解</a>
</li>
<li>
<a href="/css3-jquery-rocket-to-top/">CSS3动画与jQuery实现返回顶部小火箭</a>
</li>
<li>
<a href="/rebuild-blog-gitcafe/">再一次重建我的博客</a>
</li>
<li>
<a href="/java-poi-excel/">Java使用POI创建Excel图表</a>
</li>
<li>
<a href="/hibernate-connect-sqlite-paging-bug-repair/">Hibernate 连接 SQLite (hibernate-sqlite) 分页bug的修复</a>
</li>
<li>
<a href="/web-page-color-chart/">更全的网页颜色表</a>
</li>
<li>
<a href="/quarrying-rocky-4/">20120407春游采石矶(四)</a>
</li>
<li>
<a href="/quarrying-rocky-3/">20120407春游采石矶(三)</a>
</li>
<li>
<a href="/quarrying-rocky-2/">20120407春游采石矶(二)</a>
</li>
<li>
<a href="/quarrying-rocky/">20120407春游采石矶(一)</a>
</li>
<li>
<a href="/ahpu-spring/">安徽工程大学的春天</a>
</li>
<li>
<a href="/helps-students-assembled-computer/">帮同学组装帅气小机箱电脑一台</a>
</li>
<li>
<a href="/nanjing-trip-4/">20120310南京二日行(四)</a>
</li>
<li>
<a href="/nanjing-trip-3/">20120310南京二日行(三)</a>
</li>
<li>
<a href="/nanjing-trip-2/">20120310南京二日行(二)</a>
</li>
</ul>
</div>
</div>
<div class="widget-wrap hidden-xs">
<h3 class=widget-title>手机阅读</h3>
<div class=widget>
<div class=qrcode style="background-image:url(http://qr.liantu.com/api.php?bg=eeeeee&fg=000000&el=l&w=192&m=0&text=http://cweili.gitcafe.com/computer-network-experiment-routing-ospf-algorithm/)"></div>
</div>
</div>
<div class="widget-wrap hidden-xs">
<h3 class=widget-title>标签云</h3>
<div class="widget tagcloud">
<a href=../tag/acm style=font-size:10px>ACM</a><a href=../tag/c++ style=font-size:15.71px>C++</a><a href=../tag/css style=font-size:10px>CSS</a><a href=../tag/fedora style=font-size:15.71px>Fedora</a><a href=../tag/gnome style=font-size:11.43px>Gnome</a><a href=../tag/hibernate style=font-size:10px>Hibernate</a><a href=../tag/jshint style=font-size:10px>JSHint</a><a href=../tag/java style=font-size:11.43px>Java</a><a href=../tag/javascript style=font-size:12.86px>JavaScript</a><a href=../tag/linux style=font-size:17.14px>Linux</a><a href=../tag/pdo style=font-size:10px>PDO</a><a href=../tag/php style=font-size:12.86px>PHP</a><a href=../tag/poi style=font-size:10px>POI</a><a href=../tag/photoshop style=font-size:14.29px>Photoshop</a><a href=../tag/sae style=font-size:10px>SAE</a><a href=../tag/sql style=font-size:14.29px>SQL</a><a href=../tag/sqlite style=font-size:11.43px>SQLite</a><a href=../tag/stl style=font-size:11.43px>STL</a><a href=../tag/stu3 style=font-size:10px>Stu3</a><a href=../tag/twitter style=font-size:10px>Twitter</a><a href=../tag/virtualbox style=font-size:10px>VirtualBox</a><a href=../tag/jquery style=font-size:10px>jQuery</a><a href=../tag/三国杀 style=font-size:15.71px>三国杀</a><a href=../tag/乌镇 style=font-size:10px>乌镇</a><a href=../tag/互联网 style=font-size:10px>互联网</a><a href=../tag/动漫 style=font-size:11.43px>动漫</a><a href=../tag/动画 style=font-size:10px>动画</a><a href=../tag/南京 style=font-size:14.29px>南京</a><a href=../tag/博客 style=font-size:14.29px>博客</a><a href=../tag/实验 style=font-size:15.71px>实验</a><a href=../tag/容器 style=font-size:11.43px>容器</a><a href=../tag/小说 style=font-size:10px>小说</a><a href=../tag/微博 style=font-size:11.43px>微博</a><a href=../tag/心情 style=font-size:14.29px>心情</a><a href=../tag/摄影 style=font-size:17.14px>摄影</a><a href=../tag/操作系统 style=font-size:14.29px>操作系统</a><a href=../tag/数据库 style=font-size:18.57px>数据库</a><a href=../tag/旅行 style=font-size:20px>旅行</a><a href=../tag/日记 style=font-size:17.14px>日记</a><a href=../tag/杭州 style=font-size:11.43px>杭州</a>
</div>
</div>
<div class="widget-wrap hidden-xs">
<h3 class=widget-title>归档</h3>
<div class=widget>
<ul class=archive-list><li class=archive-list-item><a class=archive-list-link href=../archive/2014/09>September 2014</a><span class=archive-list-count>4</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2014/08>August 2014</a><span class=archive-list-count>4</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2012/09>September 2012</a><span class=archive-list-count>1</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2012/05>May 2012</a><span class=archive-list-count>2</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2012/04>April 2012</a><span class=archive-list-count>5</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2012/03>March 2012</a><span class=archive-list-count>5</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2011/12>December 2011</a><span class=archive-list-count>4</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2011/11>November 2011</a><span class=archive-list-count>18</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2011/10>October 2011</a><span class=archive-list-count>32</span></li><li class=archive-list-item><a class=archive-list-link href=../archive/2011/05>May 2011</a><span class=archive-list-count>2</span></li></ul>
</div>
</div>
<div class="widget-wrap hidden-xs">
<h3 class=widget-title>友情链接</h3>
<div class=widget>
<ul>
<li>
<a href=http://cweili.gitcafe.com target=_blank>主页</a>
</li>
</ul>
</div>
</div>
</aside>
</div>
<footer id=footer>
<div class=footer-wrap>
<div class=outer>
<div class=inner>
<div id=social-network>
<a class=link href=https://github.com/Cweili target=_blank><i class="fa fa-fw fa-github"></i></a>
<a class=link href=http://weibo.com/cweili target=_blank><i class="fa fa-fw fa-weibo"></i></a>
</div>
<div id=footer-info>
&copy; 2014 <a href=http://cweili.gitcafe.com target=_blank>Cweili</a><br>
Powered by <a href="http://hexo.io/" target=_blank>Hexo</a>.
Theme by <a href=http://cweili.gitcafe.com target=_blank>Cweili</a>.
</div>
</div>
</div>
</div>
</footer>
</div>
</div>
<div id=rocket-to-top>
<div class=onhover></div>
<div class=anim></div>
</div>
<link rel=stylesheet href=//libs.baidu.com/fontawesome/4.0.3/css/font-awesome.min.css css type=text/css>
<script src=//libs.baidu.com/jquery/1.11.1/jquery.min.js type=text/javascript></script><link rel=stylesheet href=//cdn.staticfile.org/fancybox/2.1.5/jquery.fancybox.min.css type=text/css>
<script src=//cdn.staticfile.org/fancybox/2.1.5/jquery.fancybox.min.js type=text/javascript></script><script src=../js/script.js type=text/javascript></script><script type=text/javascript>var duoshuoQuery={short_name:"cweiligitcafe"};</script><script src=//static.duoshuo.com/embed.js type=text/javascript></script><script type=text/javascript>var ujian_config={num:10,showType:3};</script><script src="http://v1.ujian.cc/code/ujian.js?uid=1539214&_=.js" type=text/javascript></script><script type=text/javascript>window._bd_share_config={common:{bdSnsKey:{},bdPopTitle:"分享到",bdMini:2,bdPopupOffsetLeft:28,bdPopupOffsetTop:108,bdMiniList:["sqq","mshare","bdysc","kaixin001","ibaidu","baidu","ff","qy","meilishuo","mogujie","diandian","ty","youdao","sdo"],bdPic:"",bdStyle:1,bdSize:"24"},share:{},image:{viewList:["tsina","qzone","tqq","weixin","tieba","renren","tqf","douban","tsohu","t163","taobao","fx","hi"],viewText:" ",viewSize:"24"},selectShare:{bdContainerClass:"article",bdSelectMiniList:["tsina","qzone","tqq","weixin","tieba","renren","tqf","douban","tsohu","t163","taobao","fx","hi"]}},document.write('<script type="text/javascript" src="http://bdimg.share.baidu.com/static/api/js/share.js?cdnversion='+~(-new Date/36e5)+'"><\/script>');</script><div id=stat-wrap>
<script src="http://s19.cnzz.com/stat.php?id=1252976445&web_id=1252976445" type=text/javascript></script></div></body></html>